New Upper Bounds for Satissability in Modal K
نویسنده
چکیده
In this paper we present new time and size bounds for satissability in modal K. This is done by means of a simpliied SAT based procedure. Then, as a direct consequence, we provide theoretical support to the claim of superior eeciency for the SAT based decision procedures, with respect to the \classic" tableau based procedures.
منابع مشابه
New upper bounds for satis ability in modal K
In this paper we present new time and size bounds for satissability in modal K. This is done by means of a simpliied SAT based procedure. Then, as a direct consequence, we provide theoretical support to the claim of superior eeciency for the SAT based decision procedures, with respect to the \classic" tableau based procedures.
متن کاملIstituto per La Ricerca Scientifica E Tecnologica New Upper Bounds for Satisfiability in Modal Logics { the Case-study of Modal K New Upper Bounds for Satissability in Modal Logics { the Case-study of Modal K
limited distribution notice This report has been submitted for publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report for early dissemination of its contents. In view of thetransfer of copyright to the outside publisher, its distribution outside of ITC prior to publication should be limited to peer communications and spe...
متن کاملNew Upper Bounds for Satissability in Modal Logics { the Case-study of Modal K
Traditional results in modal logics state that, if a formula ' is satissable in K (K-satissable), then it has a Kripke model M s.t. jjM jj 2 j'j , jjM jj being the number of states of M and j'j the number of subformulas of '. A further result states a bound of jjM jj j'j d , d being the modal depth of '. In more recent papers, a decision procedure has been proposed which branches on the truth v...
متن کاملSolving Systems of Linear Diophantine Equations: An Algebraic Approach
We describe through an algebraic and geometrical study, a new method for solving systems of linear diophantine equations. This approach yields an algorithm which is intrinsically parallel. In addition to the algorithm, we give a geometrical interpretation of the satissability of an homogeneous system, as well as upper bounds on height and length of all minimal solutions of such a system. We als...
متن کاملDecidable Fragments of First-Order Modal Logics
The paper considers the set ML1 of rst-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using the mosaic technique, we prove a general satissability criterion for formulas in ML1 which reduces the modal satissability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragm...
متن کامل